Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition

نویسنده

  • In-Sook Park
چکیده

An efficient decoding algorithm named ‘divided decoder’ is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides various combinations of two or more different searching algorithms. Hence it makes flexibility in error rate and complexity for the algorithms using it. We calculate diversity orders and upper bounds of error rates for typical models when these models are solved by divided decodings with sphere decoder, and discuss about the effects of divided decoding on complexity. Simulation results of divided decodings combined with a sphere decoder according to different splitting indices correspond to the theoretical analysis. Index Terms multiple-input multiple-output(MIMO) channels, Near maximum likelihood, MIMO detection, sphere decoder, lattice reduction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient algorithm for decoding Layered Space-Time Codes

Layered space-time codes have been designed to exploit the capacity advantage of multiple antenna systems in Rayleigh fading environments. In this paper, a new efficient decoding algorithm based on QR decomposition is presented. It needs only a fraction of computational effort compared to the standard decoding algorithm requiring the multiple calculation of the pseudo inverse of the channel mat...

متن کامل

Modified iterative sphere decoding algorithm in LTE system

In the long-term evolution (LTE) system, channel equalization makes compensation to restore the original signal, the paper puts forward iteration sphere decoding algorithm which combines traditional sphere decoding and the improved QR based on the conventional QR decomposition detection algorithm. It can effectively reduce the system complexity. At the same time, in QPSK and 16QAM, the simulati...

متن کامل

Efficient V-BLAST Detection Using Modified Fano Algorithm

We propose a sub-optimal but computationally efficient Modified Fano Detection algorithm (MFD) for V-BLAST systems. This algorithm utilizes the QR decomposition of the channel matrix and the sequential detection scheme based on tree searching to find the optimal symbol sequence. For more reliable signal detection, the decoder is designed to move backward for the specified value at the end of th...

متن کامل

Performance Analysis of a QR Decomposition Algorithm Employing Rearrangement of Antenna Layers on V-BLAST Systems

In a Rayleigh fading environment, the paper firstly introduces system model and the vertical Bell laboratories layered space-time (V-BLAST) systems structure. Several popular decoding algorithms for V-BLAST are carried on the analysis comparison, such as zero-foring (ZF), minimum mean squared error (MMSE), QR decomposition, and maximum likelihood (ML) etc. On this basis, the paper focuses on QR...

متن کامل

On the efficient use of Givens rotations in SVD-based subspace tracking algorithms

In this paper, the issue of the efficient use of Givens rotations in SVD-based QR Jacobi-type subspace tracking algorithms is addressed. By relaxing the constraint of upper triangularity on the singular value matrix, we show how even fewer Givens rotations can achieve a better diagonalization and provide more accurate singular values. Then, we investigate the efficient use of Givens rotations a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0901.3475  شماره 

صفحات  -

تاریخ انتشار 2009